The debts' clearing problem: a new approach

نویسنده

  • C. Patcas
چکیده

The debts’ clearing problem is about clearing all the debts in a group of n entities (e.g. persons, companies) using a minimal number of money transaction operations. In our previous works we studied the problem, gave a dynamic programming solution solving it and proved that it is NP-hard. In this paper we adapt the problem to dynamic graphs and give a data structure to solve it. Based on this data structure we develop a new algorithm, that improves our previous one for the static version of the problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary solving of the debts' clearing problem

The debts’ clearing problem is about clearing all the debts in a group of n entities (persons, companies etc.) using a minimal number of money transaction operations. The problem is known to be NP-hard in the strong sense. As for many intractable problems, techniques from the field of artificial intelligence are useful in finding solutions close to optimum for large inputs. An evolutionary algo...

متن کامل

The Debts’ Clearing Problem’s Relation with Complexity Classes

The debts’ clearing problem is about clearing all the debts in a group of n entities (eg. persons, companies) using a minimal number of money transaction operations. In a previous paper we conjectured the problem to be NP-complete. In this paper we prove that it is NP-hard in the strong sense and also NP-easy. We also show the same results for a restricted version of the problem.

متن کامل

Improving the schedulability of soft real-time open dynamic systems: The inheritor is actually a debtor

This paper presents the Clearing Fund Protocol, a three layered protocol designed to schedule soft real-time sets of precedence related tasks with shared resources. These sets are processed in an open dynamic environment. Open because new applications may enter the system at any time and dynamic because the schedulability is tested on-line as tasks request admission. Top-down, the three layers ...

متن کامل

تسویه تصادفی بازار با توجه به قابلیت اطمینان واحدهای تولید انرژی الکتریکی

A method for concurrent clearing of energy and reserve market is presented in this paper. The proposed method considers two important objectives in an optimization problem; the first one is including the stochastic nature of power generation variations by applying a probabilistic clearing model and Monte-Carlo simulation; the second one is assignment of energy and reserve capacities to generati...

متن کامل

Solving New Product Selection Problem by a New Hierarchical Group Decision-making Approach with Hesitant Fuzzy Setting

Selecting the most suitable alternative under uncertainty is considered as a critical decision-making problem that affects the success of organizations. In the selection process, there are a number of assessment criteria, considered by a group of decision makers, which often could be established in a multi-level hierarchy structure. The aim of this paper is to introduce a new hierarchical multi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1111.3663  شماره 

صفحات  -

تاریخ انتشار 2011